home *** CD-ROM | disk | FTP | other *** search
- Path: in1.uu.net!csnews!mox!tchrist
- From: Tom Christiansen <tchrist@mox.perl.com>
- Newsgroups: comp.lang.misc,comp.lang.perl.misc,comp.lang.tcl,comp.lang.c,comp.lang.java
- Subject: Re: Relative Speed of Perl vs. Tcl vs. C
- Date: 22 Jan 1996 15:28:39 GMT
- Organization: Perl Consulting and Training
- Message-ID: <4e0af7$glv@csnews.cs.colorado.edu>
- References: <4dhuoj$cbe@shellx.best.com> <4dudsf$187@cnn.Princeton.EDU> <ukvim4pceu.fsf@linda.teleport.com> <4e06en$a6v@solutions.solon.com>
- Reply-To: tchrist@mox.perl.com (Tom Christiansen)
- NNTP-Posting-Host: perl.com
- Originator: tchrist@mox
-
- [courtesy cc of this posting sent to cited author via email]
-
- In comp.lang.perl.misc,
- seebs@solutions.solon.com (Peter Seebach) writes:
- :>Tom Christiansen has had a long-standing bet that someone can't give
- :>him a program in C that he can't make run no more than "e" times
- :>slower (about 2.8 for you non-math-geeks) in Perl. So far, no one's
- :>done it.
-
- Well, fibonacci implemented recursively is slower than that.
- Matrix multiply is slower than that. But most things are
- faster than the stdly quoted 10x, mostly because I can figure
- out ways to get it to spend all its time in C.
-
- :But is it faster than GNU grep? :)
-
- No, but it's much faster than std fgrep.
-
- --tom
- --
- Tom Christiansen Perl Consultant, Gamer, Hiker tchrist@mox.perl.com
-
- The nice thing about standards is that there are so many of them to
- choose from. -- Andrew S. Tanenbaum
-